Improved Combinatorial Bounds on Variable Length Error Correcting Codes
نویسندگان
چکیده
Theory of error correcting codes mostly considers all words of same lengths. Mathematical tools of linear algebra and finite fields greatly helped in its development. However all words of equal lengths idea compromises with efficiency which can be better achieved through variable length codes for noisy channels. There is quite some interest and scope in error coding through variable length cod words. Sharma & Bernard’s study has provided a lead by initiating combinatorial bounds on the average codeword length of variable length error correcting codes.
منابع مشابه
The method of multiplicities
Polynomials have played a fundamental role in the construction of objects with interesting combinatorial properties, such as error correcting codes, pseudorandom generators and randomness extractors. Somewhat strikingly, polynomials have also been found to be a powerful tool in the analysis of combinatorial parameters of objects that have some algebraic structure. This method of analysis has fo...
متن کاملExponential bounds on error probability with Feedback
Feedback is useful in memoryless channels for decreasing complexity and increasing reliability; the capacity of the memoryless channels, however, can not be increased by feedback. For fixed length block codes even the decay rate of error probability with block length does not increase with feedback for most channel models. Consequently for making the physical layer more reliable for higher laye...
متن کاملStreaming Computation of Combinatorial Objects
We prove (mostly tight) space lower bounds for “streaming” (or “on-line”) computations of four fundamental combinatorial objects: error-correcting codes, universal hash functions, extractors, and dispersers. Streaming computations for these objects are motivated algorithmically by massive data set applications and complexity-theoretically by pseudorandomness and derandomization for spacebounded...
متن کاملGeneralized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels
Many of the classic problem of coding theory are highly symmetric, which makes it easy to derive spherepacking upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and sphere-covering bounds to arbitrary error models. These generalizations become especially important when the sizes of the error spheres are nonuniform. The best poss...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کامل